Model Checking with Logic Based Petri Nets
نویسندگان
چکیده
We introduce a new class of Petri nets, simple logic Petri nets (SLPN). We show how this type of nets can be efficiently mapped into logic programs with negation: the corresponding answer sets describe interleaved executions of the underlying Petri nets. We also show how to model and specify AgentSpeak agents with SLPN’s. This allows us to solve the task of model checking AgentSpeak agents by computing answer sets of the obtained logic program with any ASP system.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملResearch on Model-Checking Based on Petri Nets
Model-Checking is a formal verified technique to check on whether a computing model, by searching the model state spaces, satisfies a given property described by an appropriate temporal logic. The main drawback of model checking, the explosion problem of state spaces, is mainly caused by concurrence and the interleaving semantics used to represent any sequences of possible actions. In this pape...
متن کاملModel Checking Based on Kronecker Algebra
Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the eld of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This paper describes how a Kronecker representation of the reachability graph is employed for exploration...
متن کاملModel Checking of Time Petri Nets Based onPartial Order
Model checking of place/transition-nets based on partial order semantics has been applied successfully to the analysis of causal behaviour of distributed systems. Here, this approach is extended to the causal behaviour of time Petri nets. Expansion of a time Petri net to an equivalent P/T-net is deened, and it is shown that (an abstraction of) the McMillan unfolding of the expanded net is suuci...
متن کاملControl Interpreted Petri Nets – Model Checking and Synthesis
The chapter presents a novel approach to formal verification of logic controller programs [2], focusing especially on reconfigurable logic controllers (RLCs). Control Interpreted Petri Nets [8] are used as formal specification of logic controller behavior. The approach proposes to use an abstract rule-based logical model presented at RTL-level. A Control Interpreted Petri Net is written as a lo...
متن کامل